On the Construction of a C-counterexample to the Hamiltonian Seifert Conjecture in R

نویسندگان

  • VIKTOR L. GINZBURG
  • Krystyna Kuperberg
چکیده

We outline the construction of a proper C2-smooth function on R4 such that its Hamiltonian flow has no periodic orbits on at least one regular level set. This result can be viewed as a C2-smooth counterexample to the Hamiltonian Seifert conjecture in dimension four.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A C-smooth Counterexample to the Hamiltonian Seifert Conjecture in R

We construct a proper C-smooth function on R such that its Hamiltonian flow has no periodic orbits on at least one regular level set. This result can be viewed as a C-smooth counterexample to the Hamiltonian Seifert conjecture in dimension four.

متن کامل

A Smooth Counterexample to the Hamiltonian Seifert Conjecture in R

A smooth counterexample to the Hamiltonian Seifert conjecture in R is found. Namely, we construct a smooth proper function H : R → R, 2n ≥ 6, such that the level set {H = 1} is non-singular and has no periodic orbits for the Hamiltonian flow of H with respect to the standard symplectic structure. The function H can be taken to be C-close and isotopic to a positive-definite quadratic form so tha...

متن کامل

On the oriented perfect path double cover conjecture

‎An  oriented perfect path double cover (OPPDC) of a‎ ‎graph $G$ is a collection of directed paths in the symmetric‎ ‎orientation $G_s$ of‎ ‎$G$ such that‎ ‎each arc‎ ‎of $G_s$ lies in exactly one of the paths and each‎ ‎vertex of $G$ appears just once as a beginning and just once as an‎ ‎end of a path‎. ‎Maxov{'a} and Ne{v{s}}et{v{r}}il (Discrete‎ ‎Math‎. ‎276 (2004) 287-294) conjectured that ...

متن کامل

Counterexamples to the Cubic Graph Domination Conjecture

Let v(G) and γ(G) denote the number of vertices and the domination number of a graph G, respectively, and let ρ(G) = γ(G)/v(G). In 1996 B. Reed conjectured that ifG is a cubic graph, then γ(G) ≤ ⌈v(G)/3⌉. In 2005 A. Kostochka and B. Stodolsky disproved this conjecture for cubic graphs of connectivity one and maintained that the conjecture may still be true for cubic 2-connected graphs. Their mi...

متن کامل

On Domination in Cubic Graphs

Let v(G) and γ(G) denote the number of vertices and the domination number of a graph G, respectively, and let ρ(G) = γ(G)/v(G). In 1996 B. Reed conjectured that if G is a cubic graph, then γ(G) ≤ dv(G)/3e. In 2005 A. Kostochka and B. Stodolsky disproved this conjecture for cubic graphs of connectivity one and maintained that the conjecture may still be true for cubic 2-connected graphs. Their m...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2001